The QAP-polytope and the star transformation
نویسندگان
چکیده
The quadratic assignment problem (QAP) maybe was for a long time the one among the prominent NP-hard combinatorial optimization problems about which the fewest polyhedral results had been known. Recent work of Rijal (1995) and Padberg and Rijal (1996) has on the one hand yielded some basic facts about the associated quadratic assignment polytope, but has on the other hand shown that \naive" investigations even of the very basic questions (like the dimension, the aane hull, and the trivial facets) soon become extremely complicated. In this paper, we propose an isomorphic transformation of the \natural" realization of the quadratic assignment polytope, which simpliies the polyhedral investigations enormously. We demonstrate this by giving short proofs of the basic results on the polytope that indicate that exploiting the techniques developed in this paper deeper polyhedral investigations of the QAP now become possible. Moreover, an \inductive construction" of the QAP-Polytope is derived that might be useful in branch-and-cut algorithms.
منابع مشابه
A Basic Study of the QAP - Polytope
We investigate a polytope (the QAP-Polytope) beyond a \natural" integer programming formulation of the Quadratic Assignment Problem (QAP) that has been used successfully in order to compute good lower bounds for the QAP in the very recent years. We present basic structural properties of the QAP-Polytope, partially independently also obtained by Rijal (1995). The main original contribution of th...
متن کاملNew Facets of the QAP-Polytope
The Birkhoff polytope is defined to be the convex hull of permutation matrices, Pσ ∀σ ∈ Sn. We define a second-order permutation matrix P [2] σ in R ×n corresponding to a permutation σ as (P [2] σ )ij,kl = (Pσ)ij(Pσ)kl. We call the convex hull of the second-order permutation matrices, the second-order Birkhoff polytope and denote it by B. It can be seen that B is isomorphic to the QAP-polytope,...
متن کاملAngewandte Mathematik Und Informatik Universit at Zu K Oln on the Sqap-polytope on the Sqap-polytope
The study of the QAP-Polytope was started by Rijal (1995), Padberg and Rijal (1996), and J unger and Kaibel (1996), investigating the structure of the feasible points of a (Mixed) Integer Linear Programming formulation of the QAP that provides good lower bounds by its continious relaxation. Rijal (1995) and Padberg and Rijal (1996) propose an alternative (Mixed) Integer Linear Programming formu...
متن کاملAffine maps between quadratic assignment polytopes and subgraph isomorphism polytopes
We consider two polytopes. The quadratic assignment polytope QAP(n) is the convex hull of the set of tensors x⊗x, x ∈ Pn, where Pn is the set of n×n permutation matrices. The second polytope is defined as follows. For every permutation of vertices of the complete graph Kn we consider appropriate (n 2 ) × (n 2 ) permutation matrix of the edges of Kn. The Young polytope P ((n − 2, 2)) is the conv...
متن کاملThe Polytope of k-Star Densities
This paper describes the polytope Pk;N of i-star counts, for all i 6 k, for graphs on N nodes. The vertices correspond to graphs that are regular or as regular as possible. For even N the polytope is a cyclic polytope, and for odd N the polytope is well-approximated by a cyclic polytope. As N goes to infinity, Pk;N approaches the convex hull of the moment curve. The affine symmetry group of Pk;...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 111 شماره
صفحات -
تاریخ انتشار 2001